Randomized approximate nearest neighbors algorithm
نویسندگان
چکیده
منابع مشابه
Randomized approximate nearest neighbors algorithm.
We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in R(d), the algorithm attempts to find k nearest neighbors for each of x(j), where k is a user-specified integer parameter. The algorithm is iterative, and its running time requirements are proportional to T·N·(d·(log d) + k·(d + log k)·(log N)) + N·k(2)·(d + l...
متن کاملA Randomized Approximate Nearest Neighbors Algorithm
dimensional Euclidean space. Given N points {xj} in Rd, the algorithm attempts to find k nearest neighbors for each of xj , where k is a user-specified integer parameter. The algorithm is iterative, and its CPU time requirements are proportional to T ·N ·(d ·(log d)+ k · (log k) · (log N)) + N · k2 · (d + log k), with T the number of iterations performed. The memory requirements of the procedur...
متن کاملA Randomized Approximate Nearest Neighbors Algorithm -a Short Version
dimensional Euclidean space. Given N points {xj} in Rd, the algorithm attempts to find k nearest neighbors for each of xj , where k is a user-specified integer parameter. The algorithm is iterative, and its CPU time requirements are proportional to T ·N ·(d ·(log d)+ k · (d + log k) · (log N)) + N · k2 · (d + log k), with T the number of iterations performed. The memory requirements of the proc...
متن کاملApproximate Nearest Neighbors Algorithm - a short version
dimensional Euclidean space. Given N points {xj} in Rd, the algorithm attempts to find k nearest neighbors for each of xj , where k is a user-specified integer parameter. The algorithm is iterative, and its CPU time requirements are proportional to T ·N ·(d ·(log d)+ k · (d + log k) · (log N)) + N · k2 · (d + log k), with T the number of iterations performed. The memory requirements of the proc...
متن کاملFast Approximate Nearest Neighbors with Automatic Algorithm Configuration
For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high-dimensional problems that are faster than linear search. Approximate algorithms are known to provide large speedups with only minor loss in accuracy, but many such algorithms have been published with onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2011
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1107769108